Network hub locations problems: the state of the art

Cataloged from PDF version of article.Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin-destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hub location and provide a synthesis of the literature. (C) 2007 Elsevier B.V. All rights reserved

A new model for the hazardous waste location-routing problem

Cataloged from PDF version of article.Hazardous waste management involves the collection, transportation, treatment and disposal of hazardous wastes. In this paper a new multiobjective location-routing model is proposed. Our model also includes some constraints, which were observed in the literature but were not incorporated into previous models. The aim of the proposed model is to answer the following questions: where to open treatment centers and with which technologies, where to open disposal centers, how to route different types of hazardous waste to which of the compatible treatment technologies, and how to route waste residues to disposal centers. The model has the objective of minimizing the total cost and the transportation risk. A large-scale implementation of the model in the Central Anatolian region of Turkey is presented. © 2005

The design of single allocation incomplete hub networks

Cataloged from PDF version of article.The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with Oðn3Þ variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network. 2009 Elsevier Ltd. All rights reserved

Multimodal hub location and hub network design

Cataloged from PDF version of article.Through observations from real life hub networks, we introduce the multimodal hub location and hub network design problem. We approach the hub location problem from a network design perspective. In addition to the location and allocation decisions, we also study the decision on how the hub networks with different possible transportation modes must be designed. In this multimodal hub location and hub network design problem, we jointly consider transportation costs and travel times, which are studied separately in most hub location problems presented in the literature. We allow different transportation modes between hubs and different types of service time promises between origin–destination pairs while designing the hub network in the multimodal problem. We first propose a linear mixed integer programming model for this problem and then derive variants of the problem that might arise in certain applications. The models are enhanced via a set of effective valid inequalities and an efficient heuristic is developed. Computational analyses are presented on the various instances from the Turkish network and CAB data set

A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Cataloged from PDF version of article.Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network

A hub covering network design problem for cargo applications in Turkey

Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location problem. Through observations from the Turkish cargo sector, we propose a new mathematical model for the hub location problem that relaxes the complete hub network assumption. Our model minimizes the cost of establishing hubs and hub links, while designing a network that services each origin-destination pair within a time bound. We formulate a single-allocation hub covering model that permits visiting at most three hubs on a route. The model is then applied to the realistic instances of the Turkish network and to the Civil Aeronautics Board data set. © 2009 Operational Research Society Ltd

Design of hybrid multimodal logistic hub network with postponement strategy

This paper aims at suggesting a method allowing to design a logistic hub network in the context of postponement strategy, postponement being performed in hubs having industrial facilities in addition to logistic ones. We propose a two-stage mathematical mixed integer linear programming model for: 1) logistic hub network design 2) postponement location on the designed hub network. The suggested model manages characteristics not yet taken into account simultaneously in the literature: hierarchical logistic structure, postponement strategy, multi-commodity, multi-packaging of goods (raw materials or components vs. final products), multi-period planning. The solutions are compared through services levels and logistic costs

Measuring Incineration Plants' Performance using Combined Data Envelopment Analysis, Goal Programming and Mixed Integer Linear Programming

Incineration plants produce heat and power from waste, reduce waste disposal to landfills, and discharge harmful emissions and bottom ash. The objective of the incineration plant is to maximize desirable outputs (heat and power) and minimize undesirable outputs (emissions and bottom ash). Therefore, studying the overall impact of incineration plants in a region so as to maximize the benefits and minimize the environmental impact is significant. Majority of prior works focus on plant specific decision making issues including performance analysis. This study proposes a hybrid Data Envelopment Analysis (DEA), Goal Programming (GP) and Mixed Integer Linear Programming (MILP) model to assess the performance of incineration plants, in a specific region, to enhance overall power production, consumption of waste and reduction of emissions. This model not only helps the plant operators to evaluate the effectiveness of incineration but also facilitates the policy makers to plan for overall waste management of the region through decision-making on adding and closing plants on the basis of their efficiency. Majority of prior studies on incineration plants emphasize on how to improve their performance on heat and power production and neglect the waste management aspects. Additionally, optimizing benefits and minimizing negative outputs through fixing targets in order to make decision on shutting down the suboptimal plants has not been modeled in prior research. This research combines both the aspects and addresses the overall performance enhancement of incineration plants within a region from both policy makers and plant operators’ perspectives. The proposed combined DEA, GP and MILP model enables to optimize incineration plants performance within a region by deriving efficiency of each plant and identifying plants to close down on the basis of their performance. The proposed model has been applied to a group of 22 incineration plants in the UK using secondary data in order to demonstrate the effectiveness of the model.